package test2;

public class demo76 {
/*    class Solution {
        public boolean isPalindrome(ListNode head) {
            ListNode cur = head;
            Stack<Integer> st = new Stack();
            while(cur!=null)
            {
                st.push(cur.val);
                cur = cur.next;
            }

            while(head!=null)
            {
                if(st.peek()==head.val)
                {
                    st.pop();
                    head = head.next;
                }
                else{
                    return false;
                }
            }
            return true;
        }
    }*/
}
